By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 11, Issue 3, pp. 347-509

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Matching Nuts and Bolts in O(n log n) Time

János Komlós, Yuan Ma, and Endre Szemerédi

pp. 347-372

BibTeX  Abstract Full Text:  PDF

A Bound of 4 for the Diameter of the Symmetric Traveling Salesman Polytope

Fred J. Rispoli and Steven Cosares

pp. 373-380

BibTeX  Abstract Full Text:  PDF

Iterating an $\alpha$-ary Gray code

Jonathan Lichtner

pp. 381-386

BibTeX  Abstract Full Text:  PDF

Approximate Core Allocation for Binpacking Games

Ulrich Faigle and Walter Kern

pp. 387-399

BibTeX  Abstract Full Text:  PDF

Time and Cost Trade-Offs in Gossiping

Artur Czumaj, Leszek Gasieniec, and Andrzej Pelc

pp. 400-413

BibTeX  Abstract Full Text:  PDF

On Distance-Preserving and Domination Elimination Orderings

Victor Chepoi

pp. 414-436

BibTeX  Abstract Full Text:  PDF

Dually Chordal Graphs

Andreas Brandstädt, Feodor Dragan, Victor Chepoi, and Vitaly Voloshin

pp. 437-455

BibTeX  Abstract Full Text:  PDF

String Noninclusion Optimization Problems

Anatoly R. Rubinov and Vadim G. Timkovsky

pp. 456-467

BibTeX  Abstract Full Text:  PDF

Partial Intersection Theorem and Flows in Abstract Networks

Martin Kochol

pp. 468-486

BibTeX  Abstract Full Text:  PDF

Congestion-free Routings of Linear Complement Permutations

Mark Ramras

pp. 487-500

BibTeX  Abstract Full Text:  PDF

Fault-Tolerant Fixed Routings in Some Families of Digraphs

C. Padró, P. Morillo, and X. Muñoz

pp. 501-509

BibTeX  Abstract Full Text:  PDF